Papers with model selection
Copied to clipboard
| Challenge: | Recent advances in NLP have enabled the use of text-to-text annotation without providing training samples. |
| Approach: | They propose a text-to-text interface for automatic annotation using written guidelines without providing training samples. |
| Outcome: | The proposed approach is comparable with the fine-tuned BERT but without any training data. |
Copied to clipboard
| Challenge: | Existing studies on ABSA use a sequence tagging problem to extract aspect-specific opinion words from the sentence given the aspect. |
| Approach: | They build a series of simple yet insightful neural baselines to deal with E2E-ABSA task using contextualized embeddings from pre-trained language models. |
| Outcome: | The proposed architecture outperforms state-of-the-art models even with a simple linear classification layer. |
Copied to clipboard
| Challenge: | Reinforcement learning from human feedback (RLHF) and reward modeling are key to training powerful large language models (LLMs). |
| Approach: | They propose to combine RLHF and reward modeling to boost model selection . they also demonstrate that a small set of benchmarks could be combined to boost the model selection. |
| Outcome: | The results show that the model selection can be improved by up to 14% compared to the most common (default) choice. |
Copied to clipboard
| Challenge: | Large Vision-Language Models (LVLMs) have transformed image captioning . existing evaluations lack standardized criteria and a standardized evaluation framework . |
| Approach: | They propose a leaderboard for evaluating detailed captions that addresses three main gaps in existing evaluations: lack of standardized criteria, bias-aware assessments, and user preference considerations. |
| Outcome: | The proposed model evaluates caption quality, descriptiveness, risks, and societal biases while tailoring criteria to user preferences. |
Copied to clipboard
| Challenge: | Modern NLP systems exhibit a range of biases, which a growing literature on model debiasing attempts to correct. |
| Approach: | They propose to clarify the current situation and plot a course for meaningful progress in fair learning by making clear inter-relations among the current gamut of methods and their relation to fairness theory. |
| Outcome: | The proposed approach addresses the practical problem of model selection, which involves a trade-off between fairness and accuracy and has led to systemic issues in fairness research. |
Copied to clipboard
| Challenge: | Dialogue State Tracking (DST) is a task-oriented conversational agent that keeps track of key information exchanged during a conversation. |
| Approach: | They propose a new evaluation metric called Flexible Goal Accuracy to address shortcomings of JGA. |
| Outcome: | The proposed metric improves on existing metrics and improves performance of turn-level and non-cumulative belief state models. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are used to map classification systems to each other . however, their use is labor-intensive and requires domain expertise . |
| Approach: | They propose a prompt-based framework where LLMs perform similarity assessments between classification codes and identify final mappings through a guided decision process. |
| Outcome: | The proposed framework shows that LLMs perform better than the embedding-based framework in creating crosswalks. |
Copied to clipboard
| Challenge: | Multilingual contextual embeddings have demonstrated state-of-the-art performance in zero-shot cross-lingual transfer learning. |
| Approach: | They show that English dev accuracy makes it difficult to obtain reproducible results . they recommend providing oracle scores alongside zero-shot results if possible . |
| Outcome: | mBERT and XLM have shown strong performance on cross-lingual recognition, text classification, dependency parsing, and other tasks. |
Copied to clipboard
| Challenge: | Current evaluation practices, typically employing fixed-size benchmarks, are inherently wasteful, continuing to the predetermined sample size even when the CI reaches 2.5, saving 80% of the evaluation cost. |
| Approach: | They propose an adaptive evaluation framework that combines sequential testing with stopping criteria tailored to common evaluation needs such as diminishing returns detection and minimum detectable effect size. |
| Outcome: | The proposed framework reduces computational cost and reliability while maintaining statistical significance. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning text classification models are resource-intensive and require substantial computational power and time. |
| Approach: | They propose a corpus-driven domain mapping pipeline that integrates pre-fine-tuned models from Hugging Face Model Hub into AutoML systems to improve model selection. |
| Outcome: | The proposed pipeline improves model selection and streamlines workflows and reduces computational costs. |
Copied to clipboard
| Challenge: | Existing studies on multilingual image captioning have been hampered by a lack of high-quality evaluation datasets. |
| Approach: | They present a dataset of 3600 images annotated with human-generated captions in 36 languages. |
| Outcome: | The proposed dataset shows that it is feasible to build multilingual image captioning models trained on machine-translated data. |
Copied to clipboard
| Challenge: | Retrieval-augmented generation systems are a dominant paradigm for knowledge-intensive applications. |
| Approach: | They evaluate language models from 4B to 70B parameters within a Polish Wikipedia-based RAG pipeline. |
| Outcome: | The proposed model selection process reduces energy consumption by 83% and improves quality. |
Copied to clipboard
| Challenge: | Anomaly detection (AD) is an important machine learning task with many real-world uses, including fraud detection, medical diagnosis, and industrial monitoring. |
| Approach: | They propose a benchmark that evaluates how large language models (LLMs) can help with NLP anomaly detection. |
| Outcome: | The proposed model can perform zero-shot detection without tasks-specific training, data augmentation and model selection, and it can suggest unsupervised AD models. |
Copied to clipboard
| Challenge: | Large language models show promise in simulating human-like behavior, raising the question of their ability to represent a diverse population of users. |
| Approach: | They propose a protocol to evaluate the degree to which language models can accurately emulate human behavior in conversational recommendation systems. |
| Outcome: | The proposed protocol evaluates five tasks to reveal deviations of language models from human behavior and offers insights on how to reduce deviations with model selection and prompting strategies. |
Copied to clipboard
| Challenge: | a lack of labeled data for low-resource languages leads to the need for effective cross-lingual transfer learning. |
| Approach: | They propose a mixed training method that trains on both source and target data with stochastic gradient surgery, a novel gradient-level optimization. |
| Outcome: | The proposed method outperforms current methods on all tasks and escapes overfitting issues. |
Copied to clipboard
| Challenge: | Existing approaches to Optimization under Uncertainty (OuU) have inherent limitations and advantages. |
| Approach: | They propose a framework that automates the modeling and solving of six types of uncertainty models and generates mapping pairs to explore the potential relationship between optimization problems and optimal models. |
| Outcome: | The proposed framework achieves superior performance even on specific model types, with correlation analysis showing that data scale and specific scenario significantly influence model selection. |
Copied to clipboard
| Challenge: | Existing approaches to tabular anomaly detection fail to reflect domain specific nature of real-world anomalies. |
| Approach: | They propose a framework that constructs pseudo-evaluation sets with semantically grounded synthetic anomalies. |
| Outcome: | The proposed framework generates pseudo-evaluation sets with semantically grounded synthetic anomalies. |
Copied to clipboard
| Challenge: | a series of paradigm shifts have come with distinct characteristics and challenges associated with table modeling. |
| Approach: | They propose to replicate four table LLMs by instruction-tuning three foundation models on four existing datasets. |
| Outcome: | The results show that base model choice plays a more dominant role than training data itself. |
Copied to clipboard
| Challenge: | In unsupervised grammar induction, data likelihood is only weakly correlated with parsing accuracy, especially at convergence after multiple runs. |
| Approach: | They propose to use VAS instead of data likelihood to find better grammars by examining linguistically-motivated constraints related to syntax. |
| Outcome: | The proposed model is better suited for word order typology classification than data likelihood. |
Copied to clipboard
| Challenge: | a prompting-based approach can effectively supersede traditional KE methods, a study shows . our code is available at https://github.com/kangnlp/zero-shot-keyphrase-extraction-with-LLMs. |
| Approach: | They propose four prompting strategies for zero-shot keyphrase extraction using Large Language Models. |
| Outcome: | The proposed prompting strategies outperform state-of-the-art prompting methods on KE benchmark datasets. |
Copied to clipboard
| Challenge: | a recent study shows that performance estimations are unstable and variable . this makes it difficult to use parameter tuning and model selection . |
| Approach: | They propose to use a less variable CV method to evaluate performance . they propose lower choices of K than are typically seen in the NLP literature . |
| Outcome: | The proposed method can be used for parameter tuning and performance estimation, but it is unstable and unstable. |
Copied to clipboard
| Challenge: | Existing 3D AIGC methods don’t fully unleash human creativity. |
| Approach: | They propose a framework that generates 3D content from multimodal inputs . they propose 198 multimodal text inputs for 3D generation tasks . |
| Outcome: | The proposed framework generates 3D content from multimodal inputs without human intervention. |
Copied to clipboard
| Challenge: | evaluating models is a non-trivial task and requires extensive data and data splits to produce reliable comparisons. |
| Approach: | They propose a model selection approach that reduces the computational resources required to compare models based on single choices of random seeds. |
| Outcome: | The proposed model selection approach reduces the computational resources required to identify state-of-the-art models from large datasets. |
Copied to clipboard
| Challenge: | XLT with multilingual language models is superfluous, says a new study . mBERT, XLM-R and mT5 are effective for cross-lingual transfer, authors say . |
| Approach: | They propose to use multilingual language models to improve cross-lingual transfer (XLT) they propose to add reliable translations to training data for XLT even for non-MT languages . |
| Outcome: | The proposed approaches outperform zero-shot XLT with mLMs, the authors show . the authors believe their findings warrant a broader inclusion of more robust translation-based baselines in XL research. |
Copied to clipboard
| Challenge: | Massively multilingual language models have shown strong performance in zero-shot (ZS-XLT) and few-shot cross-lingual transfer setups where models are fine-tuned on task data in a source language are transferred without any or with only a few annotated instances to the target language(s). |
| Approach: | They propose a method that averages different checkpoints during task fine-tuning to improve model robustness. |
| Outcome: | The proposed method overestimates model performance in cross-lingual transfer setups where models are evaluated at checkpoints that generalize best to validation instances in the target languages. |
Copied to clipboard
| Challenge: | Large pre-trained language models (PLMs) such as GPT-3 have shown strong in-context learning capabilities, which are appealing for domains such as biomedicine that feature high and diverse demands of language technologies but also high data annotation costs. |
| Approach: | They propose to compare the few-shot performance of GPT-3 in-context learning with fine-tuning smaller (i.e., BERT-sized) PLMs on two representative biomedical information extraction tasks: named entity recognition and relation extraction. |
| Outcome: | The proposed model underperforms on two representative biomedical information extraction tasks. |
Copied to clipboard
| Challenge: | Large language models have significantly enhanced performance across various NLP tasks . high computational costs and latency associated with deploying such models pose bottlenecks . |
| Approach: | They propose a dynamic hybrid inference framework that efficiently selects between a strong and a weak LLM based on the complexity of the query. |
| Outcome: | The proposed method outperforms existing routing strategies by up to 5.29% in APGR . large models often introduce higher latency, making them less suitable for real-time or resource-constrained applications. |
Copied to clipboard
| Challenge: | Current benchmarks typically compare system outputs against baselines, but this method yields lower reliability than direct comparison. |
| Approach: | They propose to integrate tournament structure on top of head-to-head comparison. |
| Outcome: | The proposed model achieves higher reliability with fewer comparisons even with smaller datasets or weaker judges. |
Copied to clipboard
| Challenge: | Standard train-dev-test splits used to benchmark multiple models are now used in NLP . comparing multiple versions of the same model on the test data leads to overfitting and "expiration" of test sets. |
| Approach: | They propose to use a tune-set when developing neural network methods to do model picking. |
| Outcome: | The proposed model picker is more robust against the evaluated hyperparameter ranges than the standard split split. |
Copied to clipboard
| Challenge: | XAutoLM is a meta-learning-augmented framework that can be used to optimize discriminative and generative LM fine-tuning pipelines. |
| Approach: | They propose a meta-learning-augmented AutoML framework that reuses past experiences to optimize discriminative and generative LM fine-tuning pipelines efficiently. |
| Outcome: | XAutoLM surpasses zero-shot optimizer’s peak F1 on five of six tasks, reduces mean evaluation time of pipelines by up to 4.5x, and uncovers 50% more pipelines above zero- shot Pareto front. |
Copied to clipboard
| Challenge: | Keyphrase generation is a longstanding task in NLP with widespread applications. |
| Approach: | They propose a likelihood-based decode-select algorithm for seq2seq PLMs that improves greedy search by an average of 4.7% semantic F1 across five datasets. |
| Outcome: | The proposed algorithm improves greedy search by an average of 4.7% semantic F1 across five datasets. |
Copied to clipboard
| Challenge: | Recent work on multilingual dependency parsing focused on developing highly multilingual parsers . a recent major paradigm shift in NLP towards largescale pretrained language models has reduced the downstream relevance of supervised syntactic parse. |
| Approach: | They propose a heuristic approach to multilingual dependency parsing that heurs out the "one model to rule them all" approach by hierarchically clustering all Universal Dependencies languages based on their syntactic similarity . |
| Outcome: | The proposed approach outperforms a "one model to rule them all" approach with a heuristic selection of languages and treebanks for a target language. |
Copied to clipboard
| Challenge: | Existing methods for parameter-efficient language model tuning (PELT) match the performance of fine-tuning with fewer trainable parameters. |
| Approach: | They propose a framework which integrates different PELT methods as submodules and learns to activate the ones that best suit the current data or task setup via gating mechanism. |
| Outcome: | The proposed framework outperforms fine-tuning methods on the GLUE benchmark and achieves 14% gains over the best individual PELT method. |
Copied to clipboard
| Challenge: | a method for learning an NLI model is time-consuming and resource-intensive, but it can save time and resources. |
| Approach: | They propose a method for predicting model performance without fine-tuning it . they compare sentence embeddings with cosine similarity to classifiers . |
| Outcome: | The proposed method can save time and resources by comparing pre-trained models to real-world datasets. |
Copied to clipboard
| Challenge: | Existing work has relied on English dev data to select among models that are fine-tuned with different learning rates, number of steps and other hyperparameters, often resulting in suboptimal choices. |
| Approach: | They propose a machine learning approach that uses the fine-tuned model’s internal representations to predict its cross-lingual capabilities. |
| Outcome: | The proposed model selects better than English validation data across twenty five languages, including eight low-resource languages, and often achieves comparable results to model selection using target language development data. |
Copied to clipboard
| Challenge: | Neural scaling laws define a predictable relationship between a model’s parameter count and its performance after training in the form of a power law. |
| Approach: | They perform an empirical investigation of language understanding tasks and evaluate their results to determine whether scaling laws can be used to accelerate model development. |
| Outcome: | The proposed scaling laws can be exploited for debugging convergence when training large models, and can predict the performance of larger models. |
Copied to clipboard
| Challenge: | Existing models and evaluation settings have shortcomings regarding the coupling of answer and explanation which might cause serious issues in user experience. |
| Approach: | They propose a hierarchical model and a new regularization term to strengthen the coupling of answer and explanation and two evaluation scores to quantify the couple. |
| Outcome: | The proposed model strengthens the answer-explanation coupling and provides evaluation scores that align with user experience. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have been experiencing seismic growth in size and capabilities, radically transforming the field of NLP. |
| Approach: | They propose a generalized variant of iterative self-critique and self-refinement devoid of external influence and a ranking metric to find the optimal model for a given task considering refined performance and cost. |
| Outcome: | The proposed model improves 8.2% from baseline and even with extremely small memory footprints, outperforms ChatGPT post-refinement. |
Copied to clipboard
| Challenge: | Recent work on unsupervised constituency parsing uses labeled examples for tuning . a few-shot parser with labeles can outperform other approaches by a significant margin . |
| Approach: | They propose to use as few labeled examples as possible for model development . they propose to train existing models on the same labeles they access . |
| Outcome: | The proposed model outperforms other models on the WSJ development set by a significant margin . the proposed model can be further improved by augmentation and self-training . |
Copied to clipboard
| Challenge: | Chain-of-Thought reasoning introduces significant inference latency due to its verbosity. |
| Approach: | They propose a framework that leverages token elasticity phenomenon to progressively compress CoTs via multiround refinement. |
| Outcome: | The proposed method achieves an average accuracy improvement of 5.6% over state-of-the-art baselines while reducing CoT length by an average of 47 tokens and significantly lowering latency. |
Copied to clipboard
| Challenge: | Existing methods for text ranking are based on intuition, but their estimated transferability may not align well with the objectives of text ranking. |
| Approach: | They propose to compute expected rank as transferability, explicitly reflecting the model’s ranking capability. |
| Outcome: | The proposed method shows significant improvements over previous classification-oriented TE methods, human intuition, and ChatGPT with minor time consumption. |
Copied to clipboard
| Challenge: | Modern language models are evaluated on large benchmarks, which are difficult to make sense of. |
| Approach: | They propose a framework to Simplify Benchmark Analysis using model-centric evaluation numbers. |
| Outcome: | The proposed framework can be applied to HELM, MMLU, and BigBenchLite benchmarks. |
Copied to clipboard
| Challenge: | despite the extensive use of HMMs for sign recognition, determining the HMM structure remains a challenge . despite their success in modeling sequential and multivariate data, establishing the structure remains challenging . |
| Approach: | They propose a continuous HMM framework for modeling and recognizing isolated signs . they propose to optimize the number of states for each sign separately during recognition . |
| Outcome: | The proposed model performs better on three different datasets and is competitive with existing models. |
Copied to clipboard
| Challenge: | Existing leaderboards are often taken at face value, but this is costly . a recent study shows that minor perturbations to the benchmark result in rankings up to 8 positions. |
| Approach: | They propose to use a *hybrid* scoring method for answer selection for large language models . they find that minor perturbations to the benchmark result in rankings changes . |
| Outcome: | The proposed model is a hybrid scoring method, the authors argue . the proposed model could be used to improve the performance of large language models . |
Copied to clipboard
| Challenge: | In this paper, we discuss contamination by code generation test sets in large language models. |
| Approach: | They propose to use Python to test code generation test sets for contamination . they find that code generation is an important skill for large language models to master . |
| Outcome: | The proposed benchmarks are uncontaminated and provide a new insight into code generation. |
Copied to clipboard
| Challenge: | Existing methods for zero-shot cross-lingual transfer are unreliable due to the lack of pretraining data. |
| Approach: | They propose to accumulatively average model snapshots from different runs into a single model. |
| Outcome: | The proposed protocol decouples performance maximization from hyperparameter tuning. |
Copied to clipboard
| Challenge: | Claude, DeepSeek, GPT, LLaMA, and Mistral conceptualize sustainability and its relationship with AI. |
| Approach: | They investigated how five state-of-the-art LLMs conceptualize sustainability and its relationship with AI. |
| Outcome: | The proposed models differed significantly between models, revealing significant biases and biase . Claude, DeepSeek, GPT, LLaMA, and Mistral conceptualize sustainability and its relationship with AI. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have advanced the automation of data science workflows, yet it remains unclear whether they can critically leverage external domain knowledge as human data scientists do in practice. |
| Approach: | They propose a benchmark to evaluate how large language models handle external domain knowledge in tabular prediction tasks. |
| Outcome: | The proposed model evaluates whether it can critically leverage external domain knowledge as human data scientists do in practice. |
Copied to clipboard
| Challenge: | Knowledge-grounded dialogue systems can generate informative responses based on dialogue history and external knowledge source. |
| Approach: | They conduct a thorough experiment to determine the optimal knowledge form, mutual effects between knowl- edge and model selection, and the few-shot performance of knowledge. |
| Outcome: | The proposed method combines knowledge-grounded dialogue with human-generated dialogues to generate informative and meaningful responses. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have enabled dynamic reasoning in automated data analytics, but rigid, single-path workflows restrict strategic exploration and often lead to suboptimal outcomes. |
| Approach: | a new framework replaces rigid workflows with adaptive, multi-path planning . the framework offers two operating modes: SPIO-S and SPIO -E . |
| Outcome: | a new framework outperforms state-of-the-art pipelines on Kaggle and OpenML benchmarks. |
Copied to clipboard
| Challenge: | Existing benchmarks focus on narrow tasks and leave a fundamental question unanswered . Existing models only focus on specific tasks, requiring rigorous reasoning and knowledge . |
| Approach: | They propose a benchmark to connect theoretical foundations with practical business knowledge and applications. |
| Outcome: | The benchmark systematically evaluates both open-source and commercial LLMs . it reveals how theoretical knowledge translates into practical performance in business . |
Copied to clipboard
| Challenge: | LLM-as-Judge frameworks are increasingly popular for AI evaluation, yet research findings on the relationship between models’ generation and judgment abilities remain inconsistent. |
| Approach: | They propose a self-reference-guided evaluation strategy that leverages a model’s own answers as references to strengthen the correlation between generation and judgment abilities. |
| Outcome: | The proposed approach strengthens the correlation between model generation and judgment abilities and provides a reliable proxy for model selection in evaluation tasks. |
Copied to clipboard
| Challenge: | Speculative decoding (SD) is a useful tool for accelerating large language models . but its utility is limited by a fundamental constraint: draft and target models must share the same vocabulary . |
| Approach: | They propose an algorithm that uses a draft token sequence to get a new target token sequence and then uses DTW to build a mapping to transfer probability distributions. |
| Outcome: | The proposed method shows 1.57x speedup on various tasks. |